/* This file is part of the Palabos library.
 *
 * The Palabos softare is developed since 2011 by FlowKit-Numeca Group Sarl
 * (Switzerland) and the University of Geneva (Switzerland), which jointly
 * own the IP rights for most of the code base. Since October 2019, the
 * Palabos project is maintained by the University of Geneva and accepts
 * source code contributions from the community.
 *
 * Contact:
 * Jonas Latt
 * Computer Science Department
 * University of Geneva
 * 7 Route de Drize
 * 1227 Carouge, Switzerland
 * jonas.latt@unige.ch
 *
 * The most recent release of Palabos can be downloaded at
 * <https://palabos.unige.ch/>
 *
 * The library Palabos is free software: you can redistribute it and/or
 * modify it under the terms of the GNU Affero General Public License as
 * published by the Free Software Foundation, either version 3 of the
 * License, or (at your option) any later version.
 *
 * The library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU Affero General Public License for more details.
 *
 * You should have received a copy of the GNU Affero General Public License
 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */

#include "algorithm/basicAlgorithms.h"

namespace plb {

namespace algorithm {

std::vector<plint> primeFactor(plint value)
{
    std::vector<plint> primeFactors;
    plint testFactor = 2;
    while (testFactor <= value) {
        if (value % testFactor == 0) {
            value /= testFactor;
            primeFactors.push_back(testFactor);
        } else {
            ++testFactor;
        }
    }
    return primeFactors;
}

std::vector<plint> evenRepartition(plint value, plint d)
{
    std::vector<plint> primeFactors = primeFactor(value);
    std::vector<plint> repartition(d);
    for (plint iRep = 0; iRep < d; ++iRep) {
        repartition[iRep] = 1;
    }
    plint iDim = 0;
    for (plint iPrime = (int)(primeFactors.size() - 1); iPrime >= 0; --iPrime) {
        repartition[iDim] *= primeFactors[iPrime];
        iDim = (iDim + 1) % d;
    }
    return repartition;
}

}  // namespace algorithm

}  // namespace plb
